An algorithm for solving rank-deficient scaled total least square problems
نویسندگان
چکیده
The scaled total least square (STLS) problem, introduced by B.D. Rao in 1997, unifies both the total least square (TLS) and the least square (LS) problems. The STLS problems can be solved by the singular value decomposition (SVD). In this paper, we give a rank-revealing two-sided orthogonal decomposition method for solving the STLS problem. An error analysis is presented. Our numerical experiments show that this algorithm computes the STLS solution as good as the SVD method with less computation.
منابع مشابه
Solving Rank-Deficient Linear Least-Squares Problems*
Numerical solution of linear least-squares problems is a key computational task in science and engineering. Effective algorithms have been developed for the linear least-squares problems in which the underlying matrices have full rank and are well-conditioned. However, there are few efficient and robust approaches to solving the linear least-squares problems in which the underlying matrices are...
متن کاملAlgorithm xxx: an Efficient Algorithm for Solving Rank-Deficient Least Squares Problems
Existing routines, such as xGELSY or xGELSD in LAPACK, for solving rank-deficient least squares problems require O(mn) operations to solve min ‖b−Ax‖ where A is an m by n matrix. We present a modification of the LAPACK routine xGELSY that requires O(mnk) operations where k is the effective numerical rank of the matrix A. For low rank matrices the modification is an order of magnitude faster tha...
متن کاملA Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems
In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...
متن کاملAn Algorithm for Solving Scaled Total Least Squares Problems
In this paper, we present a rankrevealing two-sided orthogonal decomposition method for solving the STLS problem. An error analysis of the algorithm is given. Our numerical experiments show that this algorithm computes the STLS solution as accurate as the SVD method with less computation.
متن کاملFast Computation of Moore-Penrose Inverse Matrices
Many neural learning algorithms require to solve large least square systems in order to obtain synaptic weights. Moore-Penrose inverse matrices allow for solving such systems, even with rank deficiency, and they provide minimum-norm vectors of synaptic weights, which contribute to the regularization of the input-output mapping. It is thus of interest to develop fast and accurate algorithms for ...
متن کامل